OPTIMAL STOPPING PROBLEM WITH SEVERAL SEARCH AREAS

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Stopping Problem with Several Search Areas

The present paper deals with an optimal stopping problem with several possible search areas in which travel costs are assumed among the areas. In terms of the future availability of an offer once obtained and passed up, the following two cases are considered: (1) it becomes instant.ly and forever unavailable and (2) it remains forever available, called a no recall model and a recall model. resp...

متن کامل

The Problem of Optimal Stopping

The problem of Optimal Stopping is of fundamental importance for sequential analysis, for the detection of signals in a background of noise, and also for pricing American-type options in the modern theory of finance. We shall review in this talk two relatively recent approaches to this problem: the deterministic or “pathwise” approach of Davis & Karatzas (1994), and the “integral representation...

متن کامل

On a simple optimal stopping problem

L.A. Shepp has posed aild analyzed the problem of optimal random drawinp with Jut replacement from an urn containing predetermined numbers of plus and minus balls. ;Here Shepp’s results are extended by improving the bounds on value; of penturbeu urns, deriving an exact algorithm for the urn values and computing the stopping boundary for urns of u-, tn 200 balls.

متن کامل

The Byzantine Agreement Problem: Optimal Early Stopping

This paper addresses solutions to the problem of reaching agreement in the presence of faults. Whereas the need for agreement has surfaced mainly in fault tolerant real-time applications, agreement can be a useful mechanism in network security to mask intrusions. However, due to the communication overhead involved and the fact that the system is expected to operate without problems most of the ...

متن کامل

Double Optimal Stopping in the Fishing Problem

In this paper we consider the following problem. An angler buys a fishing ticket that allows him/her to fish for a fixed time. There are two locations to fish at the lake. The fish are caught according to a renewal process, which is different for each fishing location. The angler’s success is defined as the difference between the utility function, which is dependent on the size of the fish caug...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Operations Research Society of Japan

سال: 1995

ISSN: 0453-4514,2188-8299

DOI: 10.15807/jorsj.38.89